Asymptotics for sparse exponential random graph models
نویسندگان
چکیده
منابع مشابه
Asymptotics for Sparse Exponential Random Graph Models
We study the asymptotics for sparse exponential random graph models where the parameters may depend on the number of vertices of the graph. We obtain a variational principle for the limiting free energy, an associated concentration of measure, the asymptotics for the mean and variance of the limiting probability distribution, and phase transitions in the edge-triangle model. Similar analysis is...
متن کاملExponential random graph models
Synonyms p* models, p-star models, p1 models, exponential family of random graphs, maximum entropy random networks, logit models, Markov graphs Glossary • Graph and network: the terms are used interchangeably in this essay. • Real-world network: (real network, observed network) means network data the researcher has collected and is interested in modelling. • Ensemble of graphs: means the set of...
متن کاملLearning Exponential Random Graph Models
Exponential Random Graphs are common, simple statistical models for social network and other structures. Unfortunately, inference and learning with them is hard for networks larger than 20 nodes because their partition functions are intractable to compute precisely. In this paper, we introduce a novel linear-time deterministic approximation to these partition functions. Our main insight enablin...
متن کاملNew Specifications for Exponential Random Graph Models
The most promising class of statistical models for expressing structural properties of social networks observed at one moment in time is the class of exponential random graph models (ERGMs), also known as p ∗ models. The strong point of these models is that they can represent a variety of structural tendencies, such as transitivity, that define complicated dependence patterns not easily modeled...
متن کاملConditional Marginalization for Exponential Random Graph Models
For exponential random graph models, under quite general conditions, it is proved that induced subgraphs on node sets disconnected from the other nodes still have distributions from an exponential random graph model. This can help in the theoretical interpretation of such models. An application is that for saturated snowball samples from a potentially larger graph which is a realization of an e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Brazilian Journal of Probability and Statistics
سال: 2017
ISSN: 0103-0752
DOI: 10.1214/16-bjps319